Statistical Secrecy and Multi-Bit Commitments
نویسندگان
چکیده
منابع مشابه
Statistical Secrecy and Multibit Commitments
We present and compare definitions of the notion of “statistically hiding” protocols, and we propose a novel statistically hiding commitment scheme. Informally, a protocol statistically hides a secret if a computationally unlimited adversary who conducts the protocol with the owner of the secret learns almost nothing about it. One definition is based on the L1-norm distance between probability ...
متن کاملPerfect Secrecy and Statistical
There are two key properties of the above. First, given only c, Eve should not be able to learn what m is. Second, Dec(Enc(m)) = m, so that Bob can accurately determine the message that Alice wanted to send. Creating functions Enc and Dec which satisfy this is a fundamental problem of cryptography. But given the above encryption scheme, knowing what these functions are is enough for anyone to d...
متن کاملImpossibility of growing quantum bit commitments.
Quantum key distribution (QKD) is often, more correctly, called key growing. Given a short key as a seed, QKD enables two parties, connected by an insecure quantum channel, to generate a secret key of arbitrary length. Conversely, no key agreement is possible without access to an initial key. Here, we consider another fundamental cryptographic task, commitments. While, similar to key agreement,...
متن کاملStatistical Assumptions as Empirical Commitments
Researchers who study punishment and social control, like those who study other social phenomena, typically seek to generalize their findings from the data they have to some larger context: in statistical jargon, they generalize from a sample to a population. Generalizations are one important product of empirical inquiry. Of course, the process by which the data are selected introduces uncertai...
متن کاملLecture 1 : Perfect Secrecy and Statistical Authentication
• Definition of perfect secrecy • One-time pad and optimality (Shannon's theorem) • Definition of statistical one-time MAC and construction. Historically, cryptography was treated as a practical problem with practical applications. Many of these schemes were insecure due to a lack of a mathematical foundation combined with no understanding of desirable properties in cryptography systems. Howeve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1996
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v3i45.20047